an adaptive approach to increase accuracy of forward algorithm for solving evaluation problems on unstable statistical data set
نویسندگان
چکیده
nowadays, hidden markov models are extensively utilized for modeling stochastic processes. these models help researchers establish and implement the desired theoretical foundations using markov algorithms such as forward one. however, using stability hypothesis and the mean statistic for determining the values of markov functions on unstable statistical data set has led to a significant reduction in the accuracy of markov algorithms including forward algorithm used in solving evaluation problems. the model’s parameters such as the occurrence probability of observation symbol being produced by state, varies directly among the successive events. since the probability value of the above-mentioned parameter plays an important role in the accurate evaluation and assessment of the probability of observations’ occurrence in the evaluation problem by forward algorithm, the variations between events and observations generated by the states should be automatically extracted. in order to achieve this, the current paper proposes an adaptive parameter for event probability in order to match and adjust the variations in the parameter after each event during the lifetime of forward algorithm. the results of the experiments on a real set of data indicates the superior performance of the proposed method compared to other conventional methods regarding their accuracy.
منابع مشابه
An Adaptive Approach to Increase Accuracy of Forward Algorithm for Solving Evaluation Problems on Unstable Statistical Data Set
Nowadays, Hidden Markov models are extensively utilized for modeling stochastic processes. These models help researchers establish and implement the desired theoretical foundations using Markov algorithms such as Forward one. however, Using Stability hypothesis and the mean statistic for determining the values of Markov functions on unstable statistical data set has led to a significant reducti...
متن کاملAn efficient approach for solving layout problems
This paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. By this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. This is resulted from dividing area into discrete and continuous dimensions. Also defining decision var...
متن کاملa new approach to credibility premium for zero-inflated poisson models for panel data
هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...
15 صفحه اولan efficient approach for solving layout problems
this paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. by this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. this is resulted from dividing area into discrete and continuous dimensions. also defining decision var...
متن کاملNew Adaptive UKF Algorithm to Improve the Accuracy of SLAM
SLAM (Simultaneous Localization and Mapping) is a fundamental problem when an autonomous mobile robot explores an unknown environment by constructing/updating the environment map and localizing itself in this built map. The all-important problem of SLAM is revisited in this paper and a solution based on Adaptive Unscented Kalman Filter (AUKF) is presented. We will explain the detailed algorithm...
متن کاملAn Adaptive Multi-Crossover Population Algorithm for Solving Routing Problems
Throughout the history, Genetic Algorithms (GA) have been widely applied to a broad range of combinatorial optimization problems. Its easy applicability to areas such as transport or industry has been one of the reasons for its great success. In this paper, we propose a new Adaptive Multi-Crossover Population Algorithm (AMCPA). This new technique changes the philosophy of the basic genetic algo...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
journal of computer and roboticsجلد ۶، شماره ۲، صفحات ۲۹-۳۹
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023